Multi-bump type nodal solutions having a prescribed number of nodal domains: II Solutions nodales de multi-bosses ayant un nombre de domaines nodales prescrites: II
نویسندگان
چکیده
This paper is a sequel to [Liu and Wang, preprint] in which we studied nodal property of multi-bump type sign-changing solutions constructed by Coti Zelati and Rabinowitz [Comm. Pure Appl. Math. 45 (1992) 1217]. In this paper we remove a technical condition that the nonlinearity is odd, which was used in [Comm. Pure Appl. Math. 45 (1992) 1217; Liu and Wang, Multi-bump type nodal solutions having a prescribed number of nodal domains: I, Ann. I. H. Poincaré – AN 22 (2005) 597–608] for constructing multi-bump type nodal solutions having a prescribed number of nodal domains. 2005 Elsevier SAS. All rights reserved. Résumé Cet article est la suite de [Liu and Wang, preprint] sur l’analyse de la propriété nodale des solutions des multi-bosses, construites par Coti Zelati et Rabinowitz dans [Comm. Pure Appl. Math. 45 (1992) 1217]. Nous supprimons la condition technique que le terme nonlinéaire impair comme elle est utilisée dans [Comm. Pure Appl. Math. 45 (1992) 1217; Liu and Wang, Multi-bump type nodal solutions having a prescribed number of nodal domains: I, Ann. I. H. Poincaré – AN 22 (2005) 597–608], pour construire des solutions nodales de multi-bosses ayant un nombre de domaines nodaux prescrits. 2005 Elsevier SAS. All rights reserved.
منابع مشابه
Multi-bump type nodal solutions having a prescribed number of nodal domains: I Solutions nodales de multi-bosse ayant un nombre de domaines nodales prescrites: I
This paper is concerned with analyzing their nodal property of multi-bump type sign-changing solutions constructed by Coti Zelati and Rabinowitz [Comm. Pure Appl. Math. 45 (1992) 1217]. In some cases we provide both upper and lower bounds on the number of nodal domains for these solutions. 2005 Elsevier SAS. All rights reserved. Résumé Cet article concerne l’analyse de la propriété nodale des...
متن کاملOn Nodal Transport Methods
Two new classes of nodal methods, respectively weakly and strongly discontinuous ones, are introduced and applied to the neutron transport equations in X-Y geometry in the discrete ordinates approximation. These methods are then applied to approximate the solution of a well-known benchmark problem of the nuclear engineering literature. The results obtained are nally compared to the ones obtaine...
متن کاملGradient-prolongation commutativity and graph theory
This note gives conditions that must be imposed to algebraic multilevel discretizations involving at the same time nodal and edge elements so that a gradient-prolongation commutativity condition will be satisfied; this condition is very important, since it characterizes the gradients of coarse nodal functions in the coarse edge function space. They will be expressed using graph theory and they ...
متن کاملConservative identification of nodal transmissivities: theory, computational experiments and application to the Rharb coastal aquifer (Morocco)
In order to calculate the transmissivity from the inverse problem corresponding to the groundwater flow in an isotropic horizontal aquifer, a numerical conservative approach is tested. The method deals with triangulation of the domain and applies the conservation of mass to elements of the mesh using the harmonic mean for internodal transmissivities. An optimal sweeping algorithm is used to eva...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004